Relational Semantics for Modal Logics
نویسنده
چکیده
Bernd{Holger Schlinglo Institut f ur Informatik, Technische Universitat M unchen, e-mail: [email protected] Wolfgang Heinle Institut f ur angewandte Mathematik, Universitat Bern, e-mail: [email protected] Abstract In this work we survey the connections between modal logic and relation algebra. We compare various modal and relational languages for the speci cation of reactive systems by giving new translation algorithms between these languages. We then characterize the expressiveness of the languages algebraically with p-morphisms (or bisimulations). Furthermore, we show how completeness and incompleteness proofs of modal logic can be transferred to relation algebra, and give a relation algebraic treatment of modal correspondence theory. We show how our methods can be applied to stronger languages like those containing derivation rules or xpoint operators.
منابع مشابه
Interpolation in Algebraizable Logics; Semantics for Non-normal Multi-modal Logic
The two main directions pursued in the present paper are the following. The rst direction was (perhaps) started by Pigozzi in 1969. In Mak 91] and Mak 79] Maksimova proved that a normal modal logic (with a single u-nary modality) has the Craig interpolation property ii the corresponding class of algebras has the superamalgamation property. In this paper we extend Maksimova's theorem to normal m...
متن کاملGlobal Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncertainty, non-monotonic conditionals, or coalitional power. Specifically, we work in coalgebraic logic with global assumptions (i.e. a general TBox), nominals, and satisfaction operators, and prove soundness and complet...
متن کاملNeighborhoods, Ultrafilters, and Canonicity
This paper will remind the reader of neighborhood semantics for modal logics, compare them with relational semantics, and then look at some questions about neighborhood semantics that have been answered, and some which are still open. We will then introduce “ultrafilter semantics,” a way of expressing all sets over a canonical frame in an ‘effable’ way. This provides us with a conceptually easy...
متن کاملCoalgebraic semantics of modal logics: An overview
Coalgebras can be seen as a natural abstraction of Kripke frames. In the same sense, coalgebraic logics are generalised modal logics. In this paper, we give an overview of the basic tools, techniques and results that connect coalgebras and modal logic. We argue that coalgebras unify the semantics of a large range of different modal logics (such as probabilistic, graded, relational, conditional)...
متن کاملLabelled Tableau Calculi for Weak Modal Logics
Many normal and regular modal logics have simple formalizations in terms of labelled tableaux (cf. [3], [4]). But these modal logics have direct characterisation in terms of Kripke frames, and labels are naturally modelled on this kind of semantics. It is an interesting question whether this well known method can be extended to some congruent and monotonic modal logics, which are not characteri...
متن کاملConvolution Algebras: Relational Convolution, Generalised Modalities and Incidence Algebras
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantalevalued functions relative to ternary relations. The resulting notion of relational convolution leads to generalised binary and unary modal operators for qualitative and quantitative models, and to more conventional variants, when ternary ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995